KMS states onC⁎-algebras associated to higher-rank graphs
نویسندگان
چکیده
منابع مشابه
Simplicity of C-algebras Associated to Higher-rank Graphs
We prove that if Λ is a row-finite k-graph with no sources, then the associated C∗-algebra is simple if and only if Λ is cofinal and satisfies Kumjian and Pask’s Condition (A). We prove that Condition (A) is equivalent to a suitably modified version of Robertson and Steger’s original nonperiodicity condition (H3) which in particular involves only finite paths. We also characterise both cofinali...
متن کاملKms States on C*-algebras Associated to Expansive Maps
Using Walters’ version of the Ruelle-Perron-Frobenius Theorem we show the existence and uniqueness of KMS states for a certain one-parameter group of automorphisms on a C*-algebra associated to a positively expansive map on a compact metric space.
متن کاملThe H Algebras of Higher Rank Graphs
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which are partial isometries acting on the space. We call the weak operator topology closed algebra generated by these operators a higher rank semigroupoid algebra. A number of examples are discussed in detail, including t...
متن کاملTopological spaces associated to higher-rank graphs
We investigate which topological spaces can be constructed as topological realisations of higher-rank graphs. We describe equivalence relations on higher-rank graphs for which the quotient is again a higher-rank graph, and show that identifying isomorphic co-hereditary subgraphs in a disjoint union of two rank-k graphs gives rise to pullbacks of the associated C∗algebras. We describe a combinat...
متن کاملSimplicity of C-algebras Associated to Row-finite Locally Convex Higher-rank Graphs
In previous work, the authors showed that the C∗-algebra C∗(Λ) of a rowfinite higher-rank graph Λ with no sources is simple if and only if Λ is both cofinal and aperiodic. In this paper, we generalise this result to row-finite higher-rank graphs which are locally convex (but may contain sources). Our main tool is Farthing’s “removing sources” construction which embeds a row-finite locally conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2014
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2013.09.016